Maximum module values of polynomials on đzđ = r, r > 1
نویسندگان
چکیده
منابع مشابه
INVARIANT GENERALIZED FUNCTIONS ON sl(2,R) WITH VALUES IN A sl(2,R)-MODULE
Let g be a finite dimensional real Lie algebra. Let ρ : g → End(V ) be a representation of g in a finite dimensional real vector space. Let CV = ( End(V )⊗S(g) )g be the algebra of End(V )-valued invariant differential operators with constant coefficients on g. Let U be an open subset of g. We consider the problem of determining the space of generalized functions φ on U with values in V which a...
متن کاملMultivariate polynomials in R
In this short article I introduce the multipol package, which provides some functionality for handling multivariate polynomials; the package is discussed here from a programming perspective. An example from the field of enumerative combinatorics is presented. This vignette is based on Hankin (2008).
متن کاملmpoly: Multivariate Polynomials in R
The mpoly package is a general purpose collection of tools for symbolic computing with multivariate polynomials in R. In addition to basic arithmetic, mpoly can take derivatives of polynomials, compute Gröbner bases of collections of polynomials, and convert polynomials into a functional form to be evaluated. Among other things, it is hoped that mpoly will provide an R-based foundation for the ...
متن کاملAvoidable polynomials and R ⊆ L
In [3, 4] Törnquist and Weiss proved many natural Σ2 definable counterparts of classical equivalences to the Continuum Hypothesis (CH). These become equivalent to “all reals are constructible”. Following this scheme, we proved definable counterparts for some algebraic equivalent form of CH. More specifically we obtained a Σ2 version of a result about avoidable polynomials proven by Schmerl [2]....
متن کاملOn the number of (r, r+1)- factors in an (r, r+1)-factorization of a simple graph
For integers d≥ 0, s≥ 0, a (d,d+s)-graph is a graph in which the degrees of all the vertices lie in the set {d,d+1, . . . ,d+ s}. For an integer r ≥ 0, an (r,r+1)-factor of a graph G is a spanning (r,r+1)-subgraph of G. An (r,r+1)-factorization of a graph G is the expression of G as the edge-disjoint union of (r,r+1)-factors. For integers r,s≥ 0, t ≥ 1, let f (r,s, t) be the smallest integer su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publikacije Elektrotehni?kog fakulteta - serija: matematika
سال: 2004
ISSN: 0353-8893
DOI: 10.2298/petf0415001c